A Birandom Job Search Problem with Risk Tolerance
نویسندگان
چکیده
This paper considers a novel class of birandom job search problem, in which the job offers are sampled by the job searcher from a finite job set with equivalent probability and their wages are characterized as independent but maybe not identically nonnegative random variables. The job searcher knows the job offer’s wage distribution when he samples the job offer. Since the offered wage is a random variable and the reservation wage is a deterministic number, it is meaningless to make comparison directly. In order to rank the randomwage and the reservationwage and provide decision support, a risk tolerance criterion is designed, and the job searcher then accepts or rejects the sampled job offer depending on whether the risk tolerance criterion is met or not. Since the offered wages are random variables and the search process is random, it’s impossible to obtain the job searcher’s real return; in this case, its expected value can be calculated via birandom theory. Simultaneously, some propositions on the expected return as well as the average search times are also studied which may provide some valuable suggestions to the job searcher. Numerical examples are given to illustrate the decision process of the risk tolerance-based birandom job search problem.
منابع مشابه
A class of chance constrained multiobjective linear programming with birandom coefficients and its application to vendors selection
In this paper, a class of chance constrained multiobjective linear programming model with birandom coefficients is considered for vendor selection problem. Firstly we present a crisp equivalent model for a special case and give a traditional method for crisp model. Then, the technique of birandom simulation is applied to deal with general birandom objective functions and birandom constraints wh...
متن کاملA New model for integrated lot sizing and scheduling in flexible job shop problem
In this paper an integrated lot-sizing and scheduling problem in a flexible job shop environment with machine-capacity-constraint is studied. The main objective is to minimize the total cost which includes the inventory costs, production costs and the costs of machine’s idle times. First, a new mixed integer programming model,with small bucket time approach,based onProportional Lot sizing and S...
متن کاملOptimality of the flexible job shop scheduling system based on Gravitational Search Algorithm
The Flexible Job Shop Scheduling Problem (FJSP) is one of the most general and difficult of all traditional scheduling problems. The Flexible Job Shop Problem (FJSP) is an extension of the classical job shop scheduling problem which allows an operation to be processed by any machine from a given set. The problem is to assign each operation to a machine and to order the operations on the machine...
متن کاملOptimality of the flexible job shop scheduling system based on Gravitational Search Algorithm
The Flexible Job Shop Scheduling Problem (FJSP) is one of the most general and difficult of all traditional scheduling problems. The Flexible Job Shop Problem (FJSP) is an extension of the classical job shop scheduling problem which allows an operation to be processed by any machine from a given set. The problem is to assign each operation to a machine and to order the operations on the machine...
متن کاملChance-constrained Portfolio Selection with Birandom Returns
The aim of this paper is to solve the portfolio problem when security returns are birandom variables. Two types of portfolio selection based on chance measure are provided according to birandom theory. Since the proposed optimization problems are difficult to solve by traditional methods, a hybrid intelligent algorithm by integrating birandom simulation and genetic algorithm is designed. Finall...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Applied Mathematics
دوره 2012 شماره
صفحات -
تاریخ انتشار 2012